Random Number Generators: Metrics and Tests for Uniformity and Randomness
نویسندگان
چکیده
Random number generators are a small part of any computer simulation project. Yet they are the heart and the engine that drives the project. Often times software houses fail to understand the complexity involved in building a random number generator that will satisfy the project requirements and will be able to produce realistic results. Building a random number generator with a desirable periodicity, that is uniform, that produces all the random permutations with equal probability, and at random, is not an easy task. In this paper we provide tests and metrics for testing random number generators for uniformity and randomness. These tests are in addition to the already existing tests for uniformity and randomness, which we modify by running each test a large number of times on sub-sequences of random numbers, each of length n. The test result obtained each time is used to determine the probability distribution function. This eliminates the random number generator misclassification error. We also provide new tests for uniformity and randomness, the new tests for uniformity test the skewness of each one of the subgroups as well as the kurtosis. The tests for randomness, which include the Fourier spectrum, the phase spectrum, the discrete cosine transform spectrum, and the orthogonal wavelet domain, test for patterns not detected in the row data space. Finally we provide visual and acoustic tests.
منابع مشابه
Random walk tests for pseudo-random number generators
It is well known that there are no perfectly good generators of random number sequences, implying the need of testing the randomness of the sequences produced by such generators. There are many tests for measuring the uniformity of random sequences, and here we propose a few new ones, designed by random walks. The experiments we have made show that our tests discover some discrepancies of rando...
متن کاملStatistical Tests of Some Widely Used and Recently Proposed Uniform Random Number Generators
Several widely used uniform random number generators have been extensively subjected to three commonly used statistical tests of uniformity and randomness. The object was 1) to examine the power of these statistical tests to discriminate between "good" and "bad" random number generators, 11) to correlate these results with recently proposed mathematical characterizations of random number genera...
متن کاملTesting PRNG's for use in a GA
In this paper, the results of some tests including the Chi-Square and the Diehard Battery tests of randomness on some pseudo random number generators are given. The generators were chosen for use in a Genetic Algorithm (GA) package called GAGENES, written in object-oriented C++. The influence of PRNG's on a GA is discussed briefly.
متن کاملSome difficult-to-pass tests of randomness
We describe three tests of randomness—tests that many random number generators fail. In particular, all congruential generators—even those based on a prime modulus—fail at least one of the tests, as do many simple generators, such as shift register and lagged Fibonacci. On the other hand, generators that pass the three tests seem to pass all the tests in the Diehard Battery of Tests. Note that ...
متن کاملMinkowski Functionals Study of Random Number Sequences
Random number sequences are used in a wide range of applications such as simulation, sampling, numerical analysis, cryptography, and recreation. The quality of random number sequences is critical to the correctness of these applications. Many statistical tests have been developed to test various characteristics of random number generators such as randomness, independence, uniformity, etc. Most ...
متن کامل